Finite generators for countable group actions; Finite index pairs of equivalence relations; Complexity measures for recursive programs
نویسندگان
چکیده
of the Dissertation Finite generators for countable group actions; Finite index pairs of equivalence relations; Complexity measures for recursive programs
منابع مشابه
Uniformity, Universality, and Computability Theory
We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of countable groups. We begin by investigating the notion of uniform universality, first proposed by Montalbán, Reimann and Slaman. This notion is a strengthened ...
متن کاملCountable abelian group actions and hyperfinite equivalence relations
An equivalence relation E on a standard Borel space is hyperfinite if E is the increasing union of countably many Borel equivalence relations En where all En-equivalence classs are finite. In this article we establish the following theorem: if a countable abelian group acts on a standard Borel space in a Borel manner then the orbit equivalence relation is hyperfinite. The proof uses constructio...
متن کاملEquivalent Transformations of Recursive Programs with Finite Unfolding
We study equivalence relations for so-called nite recursive programs (programs with Finite Unfolding). The paper describes the universal interpretation domain and constructs complete systems for the tree and functional equivalence of nite recursive programs. We obtain the upper bound C 2 O(n) for the size of the determinant of a nite program of size n and show that this bound is also the lower ...
متن کاملSome new results on Borel irreducibility of equivalence relations ∗
We prove that orbit equivalence relations (ERs, for brevity) of generically turbulent Polish actions are not Borel reducible to ERs of a family which includes Polish actions of S∞, the group of all permutations of N, and is closed under the Fubini product modulo the ideal Fin of all finite sets, and some other operations. Our second main result shows that T2, an equivalence relation called “the...
متن کاملTHE CONNECTION BETWEEN SOME EQUIVALENCE RELATIONS ON FUZZY SUBGROUPS
This paper, deals with some equivalence relations in fuzzy subgroups. Further the probability of commuting two fuzzy subgroups of some finite abelian groups is defined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014